Normal Forms for the Algebraic Lambda-Calculus
نویسندگان
چکیده
We study the problem of defining normal forms of terms for the algebraic λ-calculus, an extension of the pure λ-calculus where linear combinations of terms are first-class entities: the set of terms is enriched with a structure of vector space, or module, over a fixed semiring. Towards a solution to the problem, we propose a variant of the original reduction notion of terms which avoids annoying behaviours affecting the original version, but we find it not even locally confluent. Finally, we consider reduction of linear combinations of terms over the semiring of polynomials with non-negative integer coefficients: terms coefficients are replaced by indeterminates and then, after reduction has taken placed, restored back to their original value by an evaluation function. Such a special setting permits us to talk about normal forms of terms and, via an evaluation function, to define such notion for any semiring.
منابع مشابه
Lambda-Definition of Function(al)s by Normal Forms
Lambda-calculus is extended in order to represent a rather large class of recursive equation systems, implicitly characterizing function(al)s or mappings of some algebraic domain into arbitrary sets. Algebraic equality will then be represented by λβδ-convertibility (or even reducibility). It is then proved, under very weak assumptions on the structure of the equations, that there always exist s...
متن کاملA characterization of the Taylor expansion of λ-terms∗
The Taylor expansion of λ-terms, as introduced by Ehrhard and Regnier, expresses a λ-term as a series of multi-linear terms, called simple terms, which capture bounded computations. Normal forms of Taylor expansions give a notion of infinitary normal forms, refining the notion of Böhm trees in a quantitative setting. We give the algebraic conditions over a set of normal simple terms which chara...
متن کاملNormal Forms in Combinatory Logic
Let R be a convergent term rewriting system, and let CR-equality on (simply typed) combinatory logic terms be the equality induced by βηRequality on terms of the (simply typed) lambda calculus under any of the standard translations between these two frameworks for higher-order reasoning. We generalize the classical notion of strong reduction to a reduction relation which generates CR-equality a...
متن کاملPolymorphic Rewriting Conserves Algebraic Confluence
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term rewriting. Algebraic and lambda terms are mixed by adding the symbols of the algebraic signature to the polymorphic lambda calculus, as higher-order constants. We show that if a many-sorted algebraic rewrite system R has the Church-Rosser property (is confluent), then R + β + type-β + type-η rewrit...
متن کاملNormalization by evaluation with typed abstract syntax
We present a simple way to implement typed abstract syntax for the lambda calculus in Haskell, using phantom types, and we specify normalization by evaluation (i.e., type-directed partial evaluation) to yield this typed abstract syntax. Proving that normalization by evaluation preserves types and yields normal forms then reduces to type-checking the specification.
متن کامل